Analysis of Modular Inverse GF (p) Implementations
نویسنده
چکیده
This paper examines several modular inverse algorithms in GF (p) that have been proposed in literature. A survey of these algorithms attempts to study the evolution of modular inversion methods and trace key areas of improvement for hardware implementation efficiency.
منابع مشابه
New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n)
approved: The computation of th GF(p) or GF(2), is one o applications. In this work, w the design of efficient hard inverse. We suggest a new c inverse algorithm to calcula a fast hardware algorithm proposed designs have the h on constrained areas and sti calculations, the module w module operates, can be se upper limit on the operand operands and internal resul infinite-precision Montgome We a...
متن کاملScalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2)
Computing the inverse of a number in finite fields GF(p) or GF(2) is equally important for cryptographic applications. This paper proposes a novel scalable and unified architecture for a Montgomery inverse hardware that operates in both GF(p) and GF(2) fields. We adjust and modify a GF(2) Montgomery inverse algorithm to accommodate multi-bit shifting hardware, making it very similar to a previo...
متن کاملScalable and Unified Hardware to Compute
Computing the inverse of a number in finite fields GF(p) or GF(2) is equally important for cryptographic applications. This paper proposes a novel scalable and unified architecture for a Montgomery inverse hardware that operates in both GF(p) and GF(2) fields. We adjust and modify a GF(2) Montgomery inverse algorithm to accommodate multi-bit shifting hardware, making it very similar to a previo...
متن کاملScalable VLSI Architecture for GF(p) Montgomery Modular Inverse Computation
Modular inverse computation is needed in several public key cryptographic applications. In this work, we present two VLSI hardware implementations used in the calculation of Montgomery modular inverse operation. The implementations are based on the same inversion algorithm, however, one is fixed (fully parallel) and the other is scalable. The scalable design is the novel modification performed ...
متن کاملDual-Field Arithmetic Unit for GF(p) and GF(2m)
In this article we present a hardware solution for finite field arithmetic with application in asymmetric cryptography. It supports calculation in GF (p) as well as in GF (2). Addition and multiplication with interleaved modular reduction are the main functionality of the unit. Additional functions—like shift operations and integer incrementation—allow the calculation of the multiplicative inve...
متن کامل